Depth-first proof search without backtracking for free-variable clausal tableaux

Depth-first Proof Search without Backtracking for Free-variable Clausal Tableaux

Depth-first proof search without backtracking for free-variable clausal tableaux

We analyse the problem of constructing a deterministic proof procedure for free variable clausal tableaux that performs depth-first proof search without backtracking; and we present a solution based on a fairness strategy. That strategy uses weight orderings and a notion of tableau subsumption to avoid proof cycles and it employs reconstruction steps to handle the destructiveness of free variab...

Depth-first Proof Search without Backtracking for Free-variable Clausal Tableaux

Depth-first Proof Search without Backtracking for Free-variable Clausal Tableaux

Proof search without backtracking for free variable tableaux

Acknowledgments I would like to take this opportunity to express my gratitude to a number of people without whom I could never have completed this thesis. neither begun nor finished this thesis. I am deeply impressed with the thoroughness with which he read through the submitted version of this thesis in a matter of days, providing valuable comments at a very detailed level. I am also grateful ...